翻訳と辞書 |
Brocard's conjecture : ウィキペディア英語版 | Brocard's conjecture
In number theory, Brocard's conjecture is a conjecture that there are at least four prime numbers between (''p''''n'')2 and (''p''''n''+1)2, for ''n'' > 1, where ''p''''n'' is the ''n''th prime number. It is widely believed that this conjecture is true. However, it remains unproven as of March 2015. The number of primes between prime squares is 2, 5, 6, 15, 9, 22, 11, 27, ... . Legendre's conjecture that there is a prime between consecutive integer squares directly implies that there are at least two primes between prime squares for ''p''''n'' ≥ 3 since ''p''''n''+1 - ''p''''n'' ≥ 2. ==Notes==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Brocard's conjecture」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|